Argument Strength Computation Based on Satisfiability Degree and Agents' Beliefs
نویسندگان
چکیده
This paper presents an agent-based argumentation framework. Different from probabilistic, fuzzy and weighted approaches, this framework considers the strength of arguments and attacks from two aspects: the inner structure of arguments and the beliefs of agents. A key concept in this framework is the notion of satisfiability degree, which is used to define the intrinsic strength of attacks and the extrinsic strength of arguments. These two kinds of strengths are combined into the degree of attack/support. Then, new semantics of this framework are defined and the relation with Dung’s approach is discussed.
منابع مشابه
Computing Preferences Based on Agents' Beliefs
The knowledgebase uncertainty and the argument preferences are considered in this paper. The uncertainty is captured by weighted satisfiability degree, while a preference relation over arguments is derived by the beliefs of an agent.
متن کاملComputational Modeling of 2-sided Message’s Effects on Perceived Argument Strength
The aim of this research is studying of 2-sided message’s effects on persuasiveness of anti-drug messages by computational modeling method. It’s been done for getting more effective and more persuasive messages. Persuasiveness of messages is measured be perceived argument strength of them which is determined by audiences. In this research, according to formative researches, a method for measuri...
متن کاملAn argumentation-based approach for reasoning about trust in information sources
During a dialogue, agents exchange information with each other and need thus to deal with incoming information. For that purpose, they should be able to reason effectively about trustworthiness of information sources. This paper proposes an argument-based system that allows an agent to reason about its own beliefs and information received from other sources. An agent’s beliefs are of two kinds:...
متن کاملSuccinct Non-Interactive Zero Knowledge Arguments from Span Programs and Linear Error-Correcting Codes
Recently, Gennaro, Gentry, Parno and Raykova [1] proposed an efficient non-interactive zero knowledge argument for Circuit-SAT, based on nonstandard notions like conscientious and quadratic span programs. We propose a new non-interactive zero knowledge argument, based on a simple combination of standard span programs (that verify the correctness of every individual gate) and high-distance linea...
متن کاملStrategies for question selection in argumentative dialogues about plans
In this article, we present a proposal to enable agents to discuss the suitability of plans based on an argumentation scheme and associated critical questions. Agents coordinate their beliefs, intentions and preferences using a dialogue game based on this argumentation scheme and its critical questions. The detail encompassed by the argumentation scheme means that there is a large number of cri...
متن کامل